Sciweavers

1709 search results - page 50 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
111
Voted
SSD
1999
Springer
99views Database» more  SSD 1999»
15 years 6 months ago
Algorithms for Joining R-Trees and Linear Region Quadtrees
The family of R-trees is suitable for storing various kinds of multidimensional objects and is considered an excellent choice for indexing a spatial database. Region Quadtrees are ...
Antonio Corral, Michael Vassilakopoulos, Yannis Ma...
AUSAI
2008
Springer
15 years 4 months ago
Revisiting Multiple-Instance Learning Via Embedded Instance Selection
Multiple-Instance Learning via Embedded Instance Selection (MILES) is a recently proposed multiple-instance (MI) classification algorithm that applies a single-instance base learne...
James R. Foulds, Eibe Frank
COOPIS
1999
IEEE
15 years 6 months ago
Selectively Materializing Data in Mediators by Analyzing User Queries
There is currently great interest in building information mediators that can integrate informationfrom multipledata sources such as databases or Web sources. The query response ti...
Naveen Ashish, Craig A. Knoblock, Cyrus Shahabi
121
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
Network Performance Anomaly Detection and Localization
Abstract—Detecting the occurrence and location of performance anomalies (e.g., high jitter or loss events) is critical to ensuring the effective operation of network infrastructu...
Paul Barford, Nick G. Duffield, Amos Ron, Joel Som...
DKE
2008
72views more  DKE 2008»
15 years 2 months ago
On space constrained set selection problems
Space constrained optimization problems arise in a variety of applications, ranging from databases to ubiquitous computing. Typically, these problems involve selecting a set of it...
Themis Palpanas, Nick Koudas, Alberto O. Mendelzon