Sciweavers

5244 search results - page 707 / 1049
» Structural Complexity of AvgBPP
Sort
View
KR
2010
Springer
15 years 11 months ago
Decomposing Description Logic Ontologies
Recent years have seen the advent of large and complex ontologies, most notably in the medical domain. As a consequence, structuring mechanisms for ontologies are nowadays viewed ...
Boris Konev, Carsten Lutz, Denis Ponomaryov, Frank...
WWW
2003
ACM
16 years 7 months ago
Piazza: data management infrastructure for semantic web applications
The Semantic Web envisions a World Wide Web in which data is described with rich semantics and applications can pose complex queries. To this point, researchers have defined new l...
Alon Y. Halevy, Zachary G. Ives, Peter Mork, Igor ...
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 7 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
CLUSTER
2005
IEEE
16 years 12 days ago
Fast Query Processing by Distributing an Index over CPU Caches
Data intensive applications on clusters often require requests quickly be sent to the node managing the desired data. In many applications, one must look through a sorted tree str...
Xiaoqin Ma, Gene Cooperman
MTDT
2003
IEEE
164views Hardware» more  MTDT 2003»
16 years 1 days ago
Applying Defect-Based Test to Embedded Memories in a COT Model
ct Defect-based testing for digital logic concentrates primarily on methods of test application, including for example at-speed structural tests and IDDQ testing. In contrast, defe...
Robert C. Aitken