Sciweavers

6750 search results - page 1172 / 1350
» Performance Analysis Framework for Layout Analysis Methods
Sort
View
147
Voted
WWW
2007
ACM
16 years 4 months ago
Efficient search in large textual collections with redundancy
Current web search engines focus on searching only the most recent snapshot of the web. In some cases, however, it would be desirable to search over collections that include many ...
Jiangong Zhang, Torsten Suel
134
Voted
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
16 years 3 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
147
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
Complexity in wireless scheduling: impact and tradeoffs
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networ...
Yung Yi, Alexandre Proutiere, Mung Chiang
DASFAA
2010
IEEE
419views Database» more  DASFAA 2010»
15 years 10 months ago
Incremental Clustering for Trajectories
Trajectory clustering has played a crucial role in data analysis since it reveals underlying trends of moving objects. Due to their sequential nature, trajectory data are often rec...
Zhenhui Li, Jae-Gil Lee, Xiaolei Li, Jiawei Han
146
Voted
RTAS
2008
IEEE
15 years 9 months ago
Bounding Worst-Case Response Time for Tasks with Non-Preemptive Regions
Real-time schedulability theory requires a priori knowledge of the worst-case execution time (WCET) of every task in the system. Fundamental to the calculation of WCET is a schedu...
Harini Ramaprasad, Frank Mueller
« Prev « First page 1172 / 1350 Last » Next »