Sciweavers

1578 search results - page 254 / 316
» Algorithmic randomness of continuous functions
Sort
View
144
Voted
PAMI
2010
168views more  PAMI 2010»
15 years 1 months ago
Surface-from-Gradients without Discrete Integrability Enforcement: A Gaussian Kernel Approach
—Representative surface reconstruction algorithms taking a gradient field as input enforces the integrability constraint in a discrete manner. While enforcing integrability allo...
Heung-Sun Ng, Tai-Pang Wu, Chi-Keung Tang
137
Voted
PODC
2010
ACM
15 years 6 months ago
Deterministic distributed vertex coloring in polylogarithmic time
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
Leonid Barenboim, Michael Elkin
ICALP
2009
Springer
16 years 3 months ago
Correlation Clustering Revisited: The "True" Cost of Error Minimization Problems
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
Nir Ailon, Edo Liberty
217
Voted
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
16 years 2 months ago
MCDB: a monte carlo approach to managing uncertain data
To deal with data uncertainty, existing probabilistic database systems augment tuples with attribute-level or tuple-level probability values, which are loaded into the database al...
Ravi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Per...
114
Voted
GLVLSI
2005
IEEE
124views VLSI» more  GLVLSI 2005»
15 years 8 months ago
SOFTENIT: a methodology for boosting the software content of system-on-chip designs
Embedded software is a preferred choice for implementing system functionality in modern System-on-Chip (SoC) designs, due to the high flexibility, and lower engineering costs pro...
Abhishek Mitra, Marcello Lajolo, Kanishka Lahiri