Sciweavers

719 search results - page 115 / 144
» Adaptive Online Time Allocation to Search Algorithms
Sort
View
KDD
2009
ACM
217views Data Mining» more  KDD 2009»
15 years 10 months ago
Efficient anomaly monitoring over moving object trajectory streams
Lately there exist increasing demands for online abnormality monitoring over trajectory streams, which are obtained from moving object tracking devices. This problem is challengin...
Yingyi Bu, Lei Chen 0002, Ada Wai-Chee Fu, Dawei L...
BROADNETS
2004
IEEE
15 years 1 months ago
The Effects of the Sub-Carrier Grouping on Multi-Carrier Channel Aware Scheduling
Channel-aware scheduling and link adaptation (LA) methods are widely considered to be crucial for realizing high data rates in wireless networks. Multi-carrier systems that spread...
Fanchun Jin, Gokhan Sahin, Amrinder Arora, Hyeong-...
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 8 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...
ER
2005
Springer
200views Database» more  ER 2005»
15 years 3 months ago
How to Tame a Very Large ER Diagram (Using Link Analysis and Force-Directed Drawing Algorithms)
Abstract. Understanding a large schema without the assistance of persons already familiar with it (and its associated applications), is a hard and very time consuming task that occ...
Yannis Tzitzikas, Jean-Luc Hainaut
DAWAK
1999
Springer
15 years 2 months ago
Dynamic Data Warehouse Design
A data warehouse DW can be seen as a set of materialized views de ned over remote base relations. When a query is posed, it is evaluated locally, using the materialized views, wi...
Dimitri Theodoratos, Timos K. Sellis