Sciweavers

1208 search results - page 227 / 242
» Uniform eventown problems
Sort
View
PACT
2005
Springer
15 years 3 months ago
OpenTS: An Outline of Dynamic Parallelization Approach
The paper is dedicated to an open T-system (OpenTS) — a programming system that supports automatic parallelization of computations for high-performance and distributed applicatio...
Sergey Abramov, Alexey I. Adamovich, Alexander Iny...
VLDB
2005
ACM
126views Database» more  VLDB 2005»
15 years 3 months ago
Consistently Estimating the Selectivity of Conjuncts of Predicates
Cost-based query optimizers need to estimate the selectivity of conjunctive predicates when comparing alternative query execution plans. To this end, advanced optimizers use multi...
Volker Markl, Nimrod Megiddo, Marcel Kutsch, Tam M...
DIALM
2004
ACM
124views Algorithms» more  DIALM 2004»
15 years 3 months ago
Localized techniques for broadcasting in wireless sensor networks
We present three localized techniques for broadcasting in large scale ad hoc networks, i.e., for the problem of disseminating a message from a source node to all the nodes in the ...
Lorenzo Orecchia, Alessandro Panconesi, Chiara Pet...
72
Voted
MOBICOM
2004
ACM
15 years 3 months ago
On k-coverage in a mostly sleeping sensor network
Sensor networks are often desired to last many times longer than the active lifetime of individual sensors. This is usually achieved by putting sensors to sleep for most of their ...
Santosh Kumar, Ten-Hwang Lai, József Balogh
CPM
2004
Springer
144views Combinatorics» more  CPM 2004»
15 years 3 months ago
A Simple Optimal Representation for Balanced Parentheses
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
Richard F. Geary, Naila Rahman, Rajeev Raman, Venk...