![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
ACM Computing Surveys, Volume 38
Volume 38, Number 1, 2006
- Tobias Bjerregaard, Shankar Mahadevan:
A survey of research and practices of Network-on-chip. 1 - Deepayan Chakrabarti
, Christos Faloutsos
:
Graph mining: Laws, generators, and algorithms. 2 - Srikumar Venugopal, Rajkumar Buyya, Kotagiri Ramamohanarao:
A taxonomy of Data Grids for distributed data sharing, management, and processing. 3
Volume 38, Number 2, 2006
- Jordi Turmo, Alicia Ageno, Neus Català:
Adaptive information extraction. 4 - Aaron Ceglar, John F. Roddick
:
Association mining. 5 - Justin Zobel, Alistair Moffat:
Inverted files for text search engines. 6
Volume 38, Number 3, 2006
- Jing Ma, Jeffrey V. Nickerson
:
Hands-on, simulated, and remote laboratories: A comparative literature review. 7 - Alice Miller
, Alastair F. Donaldson, Muffy Calder
:
Symmetry in temporal logic model checking. 8 - Liqiang Geng, Howard J. Hamilton
:
Interestingness measures for data mining: A survey. 9 - Goetz Graefe:
Implementing sorting in database systems. 10
Volume 38, Number 4, 2006
- Richard A. Frost:
Realization of natural language interfaces using lazy functional programming. 11 - Lucas Bordeaux, Youssef Hamadi, Lintao Zhang:
Propositional Satisfiability and Constraint Programming: A comparative survey. 12 - Alper Yilmaz, Omar Javed, Mubarak Shah
:
Object tracking: A survey. 13
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.