Sciweavers

6300 search results - page 935 / 1260
» We have it easy, but do we have it right
Sort
View
107
Voted
FGCS
2007
86views more  FGCS 2007»
15 years 1 months ago
A grid-based approach for enterprise-scale data mining
Abstract— We describe a grid-based approach for enterprisescale data mining that leverages database technology for I/O parallelism, and on-demand compute servers for compute para...
Ramesh Natarajan, Radu Sion, Thomas Phan
94
Voted
IJAR
2007
69views more  IJAR 2007»
15 years 1 months ago
Racing algorithms for conditional independence inference
In this article, we consider the computational aspects of deciding whether a conditional independence statement t is implied by a list of conditional independence statements L usi...
Remco R. Bouckaert, Milan Studený
81
Voted
TIT
2008
86views more  TIT 2008»
15 years 1 months ago
A One-to-One Code and Its Anti-Redundancy
One-to-one codes are "one shot" codes that assign a distinct codeword to source symbols and are not necessarily prefix codes (more generally, uniquely decodable). For ex...
Wojciech Szpankowski
TSP
2008
112views more  TSP 2008»
15 years 1 months ago
An Algebraic Coding Scheme for Wireless Relay Networks With Multiple-Antenna Nodes
Abstract--We consider the problem of coding over a half-duplex wireless relay network where both the transmitter and the receiver have respectively several transmit and receive ant...
Frédérique E. Oggier, Babak Hassibi
130
Voted
CCR
2004
153views more  CCR 2004»
15 years 1 months ago
Tree bitmap: hardware/software IP lookups with incremental updates
IP address lookup is challenging for high performance routers because it requires a longest matching prefix at speeds of up to 10 Gbps (OC-192). Existing solutions have poor updat...
Will Eatherton, George Varghese, Zubin Dittia