Sciweavers

2859 search results - page 498 / 572
» Querying Complex Structured Databases
Sort
View
OSDI
2004
ACM
14 years 8 months ago
Boxwood: Abstractions as the Foundation for Storage Infrastructure
Abstractions as the Foundation for Storage Infrastructure John MacCormick, Nick Murphy, Marc Najork, Chandramohan A. Thekkath, and Lidong Zhou Microsoft Research Silicon Valley Wr...
John MacCormick, Nick Murphy, Marc Najork, Chandra...
WSC
2008
13 years 10 months ago
Generating artificial populations using a multi-level fuzzy inference engine
The design of complex artificial populations is the first step in simulating evolution during the time span of socioeconomic variables as the family income. In this paper, a new h...
Carlos R. Garcia-Alonso, Gabriel M. Perez-Alcala
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 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
IEEECIT
2005
IEEE
14 years 1 months ago
Case Study: Distance-Based Image Retrieval in the MoBIoS DBMS
Similarity search leveraging distance-based index structures is increasingly being used for complex data types. It has been shown that for high dimensional uniform vectors with si...
Rui Mao, Wenguo Liu, Daniel P. Miranker, Qasim Iqb...
LICS
2009
IEEE
14 years 2 months ago
Logics with Rank Operators
—We introduce extensions of first-order logic (FO) and fixed-point logic (FP) with operators that compute the rank of a definable matrix. These operators are generalizations o...
Anuj Dawar, Martin Grohe, Bjarki Holm, Bastian Lau...