Sciweavers

254 search results - page 35 / 51
» Binary amiable Words
Sort
View
DM
2010
134views more  DM 2010»
14 years 11 months ago
The discrepancy of the lex-least de Bruijn sequence
We answer the following question of R. L. Graham: What is the discrepancy of the lexicographically-least binary de Bruijn sequence? Here, "discrepancy" refers to the max...
Joshua Cooper, Christine E. Heitsch
DI
2006
156views more  DI 2006»
14 years 11 months ago
Identifying almost identical files using context triggered piecewise hashing
Fuzzy hashing allows the discovery of potentially incriminating documents that may not be located using traditional hashing methods. The use of the fuzzy hash is much like the fuz...
Jesse D. Kornblum
SIGMOD
2008
ACM
86views Database» more  SIGMOD 2008»
14 years 11 months ago
The YAGO-NAGA approach to knowledge discovery
This paper gives an overview on the YAGO-NAGA approach to information extraction for building a conveniently searchable, large-scale, highly accurate knowledge base of common fact...
Gjergji Kasneci, Maya Ramanath, Fabian M. Suchanek...
ALGORITHMICA
2002
71views more  ALGORITHMICA 2002»
14 years 10 months ago
Routing Flow Through a Strongly Connected Graph
It is shown that, for every strongly connected network in which every edge has capacity at least , linear time suffices to send flow from source vertices, each with a given supply,...
Thomas Erlebach, Torben Hagerup
MLMI
2007
Springer
15 years 5 months ago
To Separate Speech
The PASCAL Speech Separation Challenge (SSC) is based on a corpus of sentences from the Wall Street Journal task read by two speakers simultaneously and captured with two circular ...
John W. McDonough, Ken'ichi Kumatani, Tobias Gehri...