Sciweavers

1578 search results - page 254 / 316
» Algorithmic randomness of continuous functions
Sort
View
PAMI
2010
168views more  PAMI 2010»
13 years 7 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
PODC
2010
ACM
14 years 18 days 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
14 years 9 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
SIGMOD
2008
ACM
169views Database» more  SIGMOD 2008»
14 years 8 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...
GLVLSI
2005
IEEE
124views VLSI» more  GLVLSI 2005»
14 years 2 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