Sciweavers

690 search results - page 114 / 138
» Dense Admissible Sets
Sort
View
CCCG
1993
13 years 8 months ago
Widest-corridor Problems
A k-dense corridor through a finite set, S, of n points in the plane is the open region of the plane that is bounded by two parallel lines that intersect the convex hull of S and ...
Ravi Janardan, Franco P. Preparata
CORR
2010
Springer
66views Education» more  CORR 2010»
13 years 7 months ago
Computing the speed of convergence of ergodic averages and pseudorandom points in computable dynamical systems
A pseudorandom point in an ergodic dynamical system over a computable metric space is a point which is computable but its dynamics has the same statistical behavior of a typical po...
Stefano Galatolo, Mathieu Hoyrup, Cristobal Rojas
ISCI
2006
58views more  ISCI 2006»
13 years 7 months ago
Streaming data reduction using low-memory factored representations
Many special purpose algorithms exist for extracting information from streaming data. Constraints are imposed on the total memory and on the average processing time per data item....
David Littau, Daniel Boley
KAIS
2006
164views more  KAIS 2006»
13 years 7 months ago
On efficiently summarizing categorical databases
Frequent itemset mining was initially proposed and has been studied extensively in the context of association rule mining. In recent years, several studies have also extended its a...
Jianyong Wang, George Karypis
PAMI
2008
174views more  PAMI 2008»
13 years 7 months ago
Multiflash Stereopsis: Depth-Edge-Preserving Stereo with Small Baseline Illumination
Traditional stereo matching algorithms are limited in their ability to produce accurate results near depth discontinuities, due to partial occlusions and violation of smoothness co...
Rogerio Feris, Ramesh Raskar, Longbin Chen, Kar-Ha...