Sciweavers

4536 search results - page 385 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
CORR
2010
Springer
275views Education» more  CORR 2010»
15 years 7 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
205
Voted
WWW
2005
ACM
16 years 7 months ago
Web data extraction based on partial tree alignment
This paper studies the problem of extracting data from a Web page that contains several structured data records. The objective is to segment these data records, extract data items...
Yanhong Zhai, Bing Liu
EWSN
2010
Springer
15 years 12 months ago
Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks
One unfortunate consequence of the success story of wireless sensor networks (WSNs) in separate research communities is an evergrowing gap between theory and practice. Even though ...
Tobias Baumgartner, Ioannis Chatzigiannakis, S&aac...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
15 years 11 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts
STACS
2010
Springer
16 years 1 months ago
Two-phase Algorithms for the Parametric Shortest Path Problem
Abstract. A parametric weighted graph is a graph whose edges are labeled with continuous real functions of a single common variable. For any instantiation of the variable, one obta...
Sourav Chakraborty, Eldar Fischer, Oded Lachish, R...