Sciweavers

4095 search results - page 59 / 819
» How to test a tree
Sort
View
IUI
2005
ACM
14 years 1 months ago
How to wreck a nice beach you sing calm incense
A principal problem in speech recognition is distinguishing between words and phrases that sound similar but have different meanings. Speech recognition programs produce a list of...
Henry Lieberman, Alexander Faaborg, Waseem Daher, ...
INFOCOM
2002
IEEE
14 years 22 days ago
How to market-manage a QoS network
This paper describes a control mechanism for a future Internet. It is an economic mechanism that enables users to choose different pairs of price/QoS priority levels for network se...
Jörn Altmann, Huw Oliver, Hans Daanen, Alfons...
VLDB
2002
ACM
137views Database» more  VLDB 2002»
13 years 7 months ago
Comparing Data Streams Using Hamming Norms (How to Zero In)
Massive data streams are now fundamental to many data processing applications. For example, Internet routers produce large scale diagnostic data streams. Such streams are rarely s...
Graham Cormode, Mayur Datar, Piotr Indyk, S. Muthu...
JOCN
2011
141views more  JOCN 2011»
12 years 10 months ago
Changes in Events Alter How People Remember Recent Information
■ Observers spontaneously segment larger activities into smaller events. For example, “washing a car” might be segmented into “scrubbing,” “rinsing,” and “drying...
Khena M. Swallow, Deanna M. Barch, Denise Head, Co...
CEC
2005
IEEE
14 years 1 months ago
Geometric landscape of homologous crossover for syntactic trees
The relationship between search space, distances and genetic operators for syntactic trees is little understood. Geometric crossover and geometric mutation are representation-indep...
Alberto Moraglio, Riccardo Poli