562 search results - page 21 / 113 » Dependency Pairs Revisited |
192
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
128
click to vote
ICASSP
2009
IEEE
16 years 27 days ago
2009
IEEE
Letter units, or graphemes, have been reported in the literature as a surprisingly effective substitute to the more traditional phoneme units, at least in languages that enjoy a s...
121
click to vote
PERVASIVE
2010
Springer
16 years 19 days ago
2010
Springer
It has been considered a fact that GPS performs too poorly inside buildings to provide usable indoor positioning. We analyze results of a measurement campaign to improve on the und...
158
click to vote
SAC
2006
ACM
16 years 3 days ago
2006
ACM
Recently renewed interest in scalable database systems for shared nothing clusters has been supported by replication protocols based on group communication that are aimed at seaml...
146
click to vote
IFIP
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we propose a formalization of probable innocence, a notion of probabilistic anonymity that is associated to “realistic” protocols such as Crowds. We analyze crit...