Sciweavers

1346 search results - page 164 / 270
» On the number of rectangular partitions
Sort
View
CP
2009
Springer
15 years 10 months ago
Exploiting Problem Structure for Solution Counting
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
Aurélie Favier, Philippe Jégou, Simo...
CVPR
2009
IEEE
15 years 4 months ago
Automatic facial landmark labeling with minimal supervision
Landmark labeling of training images is essential for many learning tasks in computer vision, such as object detection, tracking, and alignment. Image labeling is typically conduc...
Yan Tong, Xiaoming Liu 0002, Frederick W. Wheeler,...
SSD
2005
Springer
105views Database» more  SSD 2005»
15 years 3 months ago
Evaluation of Top-k OLAP Queries Using Aggregate R-Trees
Abstract. A top-k OLAP query groups measures with respect to some abstraction level of interesting dimensions and selects the k groups with the highest aggregate value. An example ...
Nikos Mamoulis, Spiridon Bakiras, Panos Kalnis
VTS
2003
IEEE
119views Hardware» more  VTS 2003»
15 years 3 months ago
Test Data Compression Using Dictionaries with Fixed-Length Indices
—We present a dictionary-based test data compression approach for reducing test data volume and testing time in SOCs. The proposed method is based on the use of a small number of...
Lei Li, Krishnendu Chakrabarty
78
Voted
SIGGRAPH
2010
ACM
15 years 2 months ago
Feature-aligned T-meshes
High-order and regularly sampled surface representations are more efficient and compact than general meshes and considerably simplify many geometric modeling and processing algor...
Ashish Myles, Nico Pietroni, Denis Kovacs, Denis Z...