Sciweavers

82 search results - page 11 / 17
» Optimizing RAID for long term data archives
Sort
View
DMSN
2009
ACM
15 years 6 months ago
Validated cost models for sensor network queries
Generating a good execution plan for a declarative query has long been a central problem in data management research. With the rise in interest in wireless sensor networks (WSNs) ...
Christian Y. A. Brenninkmeijer, Ixent Galpin, Alva...
HICSS
2002
IEEE
76views Biometrics» more  HICSS 2002»
15 years 4 months ago
An Approach to Middleware for Repeatable Collaborative Processes
Research suggests that in order for GSS to be deployed successfully over the long term, it must be integrated into the daily work practices of an organization, in support of repea...
Thomas Gregory, Robert O. Briggs
97
Voted
IOPADS
1996
87views more  IOPADS 1996»
15 years 29 days ago
Structured Permuting in Place on Parallel Disk Systems
The ability to perform permutations of large data sets in place reduces the amount of necessary available disk storage. The simplest way to perform a permutation often is to read ...
Leonard F. Wisniewski
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
15 years 12 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
ICRA
2009
IEEE
141views Robotics» more  ICRA 2009»
15 years 6 months ago
Detecting repeated motion patterns via Dynamic Programming using motion density
— In this paper, we propose a method that detects repeated motion patterns in a long motion sequence efficiently. Repeated motion patterns are the structured information that ca...
Koichi Ogawara, Yasufumi Tanabe, Ryo Kurazume, Tsu...