Sciweavers

26 search results - page 3 / 6
» The minimal covering set in large tournaments
Sort
View
DLT
2006
14 years 11 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
NDSS
2009
IEEE
15 years 4 months ago
Coordinated Scan Detection
Coordinated attacks, where the tasks involved in an attack are distributed amongst multiple sources, can be used by an adversary to obfuscate his incursion. In this paper we prese...
Carrie Gates
EDBT
2006
ACM
120views Database» more  EDBT 2006»
15 years 9 months ago
Query Planning in the Presence of Overlapping Sources
Navigational queries on Web-accessible life science sources pose unique query optimization challenges. The objects in these sources are interconnected to objects in other sources, ...
Jens Bleiholder, Samir Khuller, Felix Naumann, Lou...
ICCSA
2003
Springer
15 years 2 months ago
Robust Speaker Recognition Against Utterance Variations
A speaker model in speaker recognition system is to be trained from a large data set gathered in multiple sessions. Large data set requires large amount of memory and computation, ...
JongJoo Lee, JaeYeol Rheem, Ki Yong Lee
TOG
2002
102views more  TOG 2002»
14 years 9 months ago
Hierarchical pattern mapping
We present a multi-scale algorithm for mapping a texture defined by an input image onto an arbitrary surface. It avoids the generation and storage of a new, specific texture. The ...
Cyril Soler, Marie-Paule Cani, Alexis Angelidis