7259 search results - page 1230 / 1452 » From Fields to Trees |
219
click to vote
IJCAI
2003
15 years 8 months ago
2003
We propose a new framework to study properties of consistency in a Constraint Network from the perspective of properties of set intersection. Our framework comes with a proof sche...
178
click to vote
UAI
2004
15 years 8 months ago
2004
In this paper, we present a Branch and Bound algorithm called QuickBB for computing the treewidth of an undirected graph. This algorithm performs a search in the space of perfect ...
191
click to vote
ISCAPDCS
2003
15 years 8 months ago
2003
Data intensive service functions such as memory allocation/de-allocation, data prefetching, and data relocation can pollute processor cache in conventional systems since the same ...
176
click to vote
SDM
2003
SIAM
15 years 8 months ago
2003
SIAM
A major challenge in document clustering is the extremely high dimensionality. For example, the vocabulary for a document set can easily be thousands of words. On the other hand, ...
176
click to vote
ACL
1998
15 years 8 months ago
1998
We show how the DOP model can be used for fast and robust processing of spoken input in a practical spoken dialogue system called OVIS. OVIS, Openbaar Vervoer Informatie Systeem (...