Sciweavers

971 search results - page 159 / 195
» Approximate Satisfiability and Equivalence
Sort
View
TKDE
2008
107views more  TKDE 2008»
14 years 11 months ago
Adaptive Broadcasting for Similarity Queries in Wireless Content Delivery Systems
We present a new adaptive and energy-efficient broadcast model to support flexible responses to client queries. Clients do not have to request documents by name, since they may kno...
Wei Wang, Chinya V. Ravishankar
TON
2008
125views more  TON 2008»
14 years 11 months ago
Two techniques for fast computation of constrained shortest paths
Abstract-- Computing constrained shortest paths is fundamental to some important network functions such as QoS routing, which is to find the cheapest path that satisfies certain co...
Shigang Chen, Meongchul Song, Sartaj Sahni
TSP
2008
69views more  TSP 2008»
14 years 11 months ago
A Frame Construction and a Universal Distortion Bound for Sparse Representations
Abstract-- We consider approximations of signals by the elements of a frame in a complex vector space of dimension N and formulate both the noiseless and the noisy sparse represent...
Mehmet Akçakaya, Vahid Tarokh
CJ
2004
105views more  CJ 2004»
14 years 11 months ago
Generalized Template Splay: A Basic Theory and Calculus
act interpretation. R. Barbuti, C. Bernardeschi and N. De Francesco With mobile technology more and more prominent, the problem of security leakages becomes more and more important...
George F. Georgakopoulos, David J. McClurkin
CONSTRAINTS
1998
112views more  CONSTRAINTS 1998»
14 years 11 months ago
Temporal Constraints: A Survey
Abstract. Temporal Constraint Satisfaction is an information technology useful for representing and answering queries about the times of events and the temporal relations between t...
Eddie Schwalb, Lluís Vila