Sciweavers

2061 search results - page 22 / 413
» The continuous knapsack set
Sort
View
ORL
2010
129views more  ORL 2010»
14 years 8 months ago
Additive envelopes of continuous functions
We present an iterative method for constructing additive envelopes of continuous functions on a compact set, with contact at a prespecified point. For elements of a class of subm...
Bruno H. Strulovici, Thomas A. Weber
JSYML
2010
107views more  JSYML 2010»
14 years 8 months ago
A proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) ...
Arthur Paul Pedersen, Itay Ben-Yaacov
67
Voted
TIT
2008
89views more  TIT 2008»
14 years 9 months ago
Joint Fixed-Rate Universal Lossy Coding and Identification of Continuous-Alphabet Memoryless Sources
Abstract--The problem of joint universal source coding and density estimation is considered in the setting of fixed-rate lossy coding of continuous-alphabet memoryless sources. For...
Maxim Raginsky
174
Voted
VLDB
2004
ACM
112views Database» more  VLDB 2004»
15 years 9 months ago
Tracking set-expression cardinalities over continuous update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
SSD
2007
Springer
243views Database» more  SSD 2007»
15 years 3 months ago
Continuous Medoid Queries over Moving Objects
In the k-medoid problem, given a dataset P, we are asked to choose k points in P as the medoids. The optimal medoid set minimizes the average Euclidean distance between the points ...
Stavros Papadopoulos, Dimitris Sacharidis, Kyriako...