Sciweavers

11211 search results - page 1977 / 2243
» Rank-Sensitive Data Structures
Sort
View
123
Voted
SAT
2005
Springer
133views Hardware» more  SAT 2005»
15 years 9 months ago
Solving Over-Constrained Problems with SAT Technology
Abstract. We present a new generic problem solving approach for overconstrained problems based on Max-SAT. We first define a clausal form formalism that deals with blocks of clau...
Josep Argelich, Felip Manyà
128
Voted
SCIA
2005
Springer
155views Image Analysis» more  SCIA 2005»
15 years 9 months ago
Joint Spatial-Temporal Color Demosaicking
—Color demosaicking is critical to the image quality of digital still and video cameras that use a single-sensor array. Limited by the mosaic sampling pattern of the color filte...
Xiaolin Wu, Lei Zhang
135
Voted
SLSFS
2005
Springer
15 years 9 months ago
Incorporating Constraints and Prior Knowledge into Factorization Algorithms - An Application to 3D Recovery
Abstract. Matrix factorization is a fundamental building block in many computer vision and machine learning algorithms. In this work we focus on the problem of ”structure from mo...
Amit Gruber, Yair Weiss
101
Voted
VLDB
2005
ACM
113views Database» more  VLDB 2005»
15 years 9 months ago
Optimistic Intra-Transaction Parallelism on Chip Multiprocessors
With the advent of chip multiprocessors, exploiting intra-transaction parallelism is an attractive way of improving transaction performance. However, exploiting intra-transaction ...
Christopher B. Colohan, Anastassia Ailamaki, J. Gr...
142
Voted
WADS
2005
Springer
149views Algorithms» more  WADS 2005»
15 years 9 months ago
Balanced Aspect Ratio Trees Revisited
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
Amitabh Chaudhary, Michael T. Goodrich
« Prev « First page 1977 / 2243 Last » Next »