Sciweavers

2738 search results - page 201 / 548
» Evaluating Discourse Processing Algorithms
Sort
View
STACS
2005
Springer
15 years 7 months ago
Cycle Cover with Short Cycles
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
Nicole Immorlica, Mohammad Mahdian, Vahab S. Mirro...
DATE
2004
IEEE
105views Hardware» more  DATE 2004»
15 years 5 months ago
Time-Energy Design Space Exploration for Multi-Layer Memory Architectures
This paper presents an exploration algorithm which examines execution time and energy consumption of a given application, while considering a parameterized memory architecture. Th...
Radoslaw Szymanek, Francky Catthoor, Krzysztof Kuc...
DGO
2006
148views Education» more  DGO 2006»
15 years 3 months ago
Automatically labeling hierarchical clusters
Government agencies must often quickly organize and analyze large amounts of textual information, for example comments received as part of notice and comment rulemaking. Hierarchi...
Pucktada Treeratpituk, Jamie Callan
110
Voted
SIGIR
2002
ACM
15 years 1 months ago
Unsupervised document classification using sequential information maximization
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
Noam Slonim, Nir Friedman, Naftali Tishby
115
Voted
EDBT
2006
ACM
255views Database» more  EDBT 2006»
16 years 2 months ago
FIS-by-Step: Visualization of the Fast Index Scan for Nearest Neighbor Queries
Abstract. Many different index structures have been proposed for spatial databases to support efficient query processing. However, most of these index structures suffer from an exp...
Elke Achtert, Dominik Schwald