Sciweavers

3898 search results - page 190 / 780
» On the Bit Extraction Problem
Sort
View
ICSM
2009
IEEE
15 years 9 months ago
Visualizing the Java heap demonstration proposal
Many of the problems that occur in long-running systems involve the way that the system uses memory. We have developed a framework for extracting and building a model of the heap ...
Steven P. Reiss
NAACL
1994
15 years 4 months ago
Principles of Template Design
The functionality of systems that extract information from texts can be specified quite simply: the input is a stream of texts and the output is some representation of the informa...
Jerry R. Hobbs, David J. Israel
DCC
2008
IEEE
16 years 2 months ago
Compression of Hyperspectral Images with LVQ-SPECK
We discuss the use of lattice vector quantizers in conjunction with a quadtree-based sorting algorithm for the compression of multidimensional data sets, as encountered, for examp...
Alessandro J. S. Dutra, William A. Pearlman, Eduar...
COCO
2009
Springer
124views Algorithms» more  COCO 2009»
15 years 9 months ago
The Maximum Communication Complexity of Multi-Party Pointer Jumping
—We study the one-way number-on-the-forhead (NOF) communication complexity of the k-layer pointer jumping problem. Strong lower bounds for this problem would have important impli...
Joshua Brody
CPM
2009
Springer
94views Combinatorics» more  CPM 2009»
15 years 9 months ago
Online Approximate Matching with Non-local Distances
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
Raphaël Clifford, Benjamin Sach