Sciweavers

2215 search results - page 304 / 443
» Wide open spaces
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
14 years 10 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
EDBT
2008
ACM
125views Database» more  EDBT 2008»
14 years 10 months ago
On the brink: searching for drops in sensor data
Sensor networks have been widely used to collect data about the environment. When analyzing data from these systems, people tend to ask exploratory questions--they want to find su...
Gong Chen, Junghoo Cho, Mark H. Hansen
MOBIHOC
2006
ACM
14 years 10 months ago
Analysis of random mobility models with PDE's
In this paper we revisit two classes of mobility models which are widely used to represent users' mobility in wireless networks: Random Waypoint (RWP) and Random Direction (R...
Michele Garetto, Emilio Leonardi
SDM
2009
SIAM
114views Data Mining» more  SDM 2009»
14 years 7 months ago
Top-k Correlative Graph Mining.
Correlation mining has been widely studied due to its ability for discovering the underlying occurrence dependency between objects. However, correlation mining in graph databases ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
ICCD
2005
IEEE
165views Hardware» more  ICCD 2005»
14 years 7 months ago
Applying Resource Sharing Algorithms to ADL-driven Automatic ASIP Implementation
Presently, Architecture Description Languages (ADLs) are widely used to raise the abstraction level of the design space exploration of Application Specific Instruction-set Proces...
Ernst Martin Witte, Anupam Chattopadhyay, Oliver S...