4095 search results - page 289 / 819 » How to test a tree |
112
Voted
DIALM
2004
ACM
15 years 4 months ago
2004
ACM
The wireless connectivity, essential for pervasive computing, has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID tags etc....
112
click to vote
SODA
2008
ACM
15 years 2 months ago
2008
ACM
We show a tight lower bound of (N log log N) on the number of transmission required to compute the parity of N bits (with constant error) in a network of N randomly placed sensors...
169
click to vote
CPP
2011
14 years 16 days ago
2011
Parsing text to identify grammatical structure is a common task, especially in relation to programming languages and associated tools such as compilers. Parsers for context-free g...
95
Voted
ICIP
2005
IEEE
16 years 2 months ago
2005
IEEE
In this article, we propose a special type of decision tree, called a decision cascade, for binarizing document images. Such images are produced by cameras, resulting in varying de...
210
Voted
VLDB
2003
ACM
16 years 29 days ago
2003
ACM
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...