Sciweavers

210 search results - page 5 / 42
» Considering Ill-Definedness of Problems from the Aspect of S...
Sort
View
ICIP
2005
IEEE
14 years 9 months ago
Sampling in practice: is the best reconstruction space bandlimited?
Shannon's sampling theory and its variants provide effective solutions to the problem of reconstructing a signal from its samples in some "shift-invariant " space, ...
Sathish Ramani, Dimitri Van De Ville, Michael Unse...
WDAG
2007
Springer
82views Algorithms» more  WDAG 2007»
14 years 1 months ago
The Space Complexity of Unbounded Timestamps
The timestamp problem captures a fundamental aspect of asynchronous distributed computing. It allows processes to label events throughout the system with timestamps that provide in...
Faith Ellen, Panagiota Fatourou, Eric Ruppert
COMPGEOM
1995
ACM
13 years 11 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...
ADAEUROPE
2008
Springer
13 years 9 months ago
Real-Time Distribution Middleware from the Ada Perspective
Standards for distribution middleware sometimes impose restrictions and often allow the implementations to decide on aspects that are fundamental to the correct and efficient behav...
Héctor Pérez, J. Javier Gutié...
SPIRE
2005
Springer
14 years 26 days ago
Using the k-Nearest Neighbor Graph for Proximity Searching in Metric Spaces
Proximity searching consists in retrieving from a database, objects that are close to a query. For this type of searching problem, the most general model is the metric space, where...
Rodrigo Paredes, Edgar Chávez