Sciweavers

2913 search results - page 90 / 583
» How Much to Copy
Sort
View
SIGMOD
2008
ACM
107views Database» more  SIGMOD 2008»
14 years 10 months ago
Outlier-robust clustering using independent components
How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape ...
Christian Böhm, Christos Faloutsos, Claudia P...
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 10 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo
ICFP
2004
ACM
14 years 10 months ago
Slideshow: functional presentations
Among slide-presentation systems, the dominant application offers lly no abstraction capability. Slideshow, an extension of PLT Scheme, represents our effort over the last several...
Robert Bruce Findler, Matthew Flatt
MOBISYS
2008
ACM
14 years 9 months ago
Cascadia: a system for specifying, detecting, and managing rfid events
Cascadia is a system that provides RFID-based pervasive computing applications with an infrastructure for specifying, extracting and managing meaningful high-level events from raw...
Evan Welbourne, Nodira Khoussainova, Julie Letchne...
MOBIHOC
2002
ACM
14 years 9 months ago
On the minimum node degree and connectivity of a wireless multihop network
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k?connectivity. Both topology attributes depend on the spat...
Christian Bettstetter