Sciweavers

934 search results - page 42 / 187
» exact 2007
Sort
View
ICALP
2007
Springer
15 years 3 months ago
Unbounded-Error One-Way Classical and Quantum Communication Complexity
This paper studies the gap between classical one-way communication complexity C(f) and its quantum counterpart Q(f), under the unbounded-error setting, i.e., it is enough that the ...
Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, Sh...
SOFSEM
2007
Springer
15 years 3 months ago
Fast Approximate Point Set Matching for Information Retrieval
We investigate randomised algorithms for subset matching with spatial point sets—given two sets of d-dimensional points: a data set T consisting of n points and a pattern P consi...
Raphaël Clifford, Benjamin Sach
WEA
2007
Springer
116views Algorithms» more  WEA 2007»
15 years 3 months ago
Optimal Edge Deletions for Signed Graph Balancing
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
ECIR
2007
Springer
14 years 11 months ago
A Study of Global Inference Algorithms in Multi-document Summarization
Abstract. In this work we study the theoretical and empirical properties of various global inference algorithms for multi-document summarization. We start by defining a general fr...
Ryan T. McDonald
DAM
2007
67views more  DAM 2007»
14 years 9 months ago
NP-completeness of generalized multi-Skolem sequences
A Skolem sequence is a sequence a1, a2, . . . , a2n (where ai ∈ A = {1, . . . , n}), each ai occurs exactly twice in the sequence and the two occurrences are exactly ai position...
Gustav Nordh