Sciweavers

2432 search results - page 258 / 487
» Degrees and choice numbers
Sort
View
210
Voted
ADMA
2010
Springer
271views Data Mining» more  ADMA 2010»
15 years 1 months ago
Exploiting Concept Clumping for Efficient Incremental E-Mail Categorization
We introduce a novel approach to incremental e-mail categorization based on identifying and exploiting "clumps" of messages that are classified similarly. Clumping reflec...
Alfred Krzywicki, Wayne Wobcke
JCO
2011
113views more  JCO 2011»
15 years 1 months ago
Hardness and algorithms for rainbow connection
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, denoted r...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah, ...
TIT
2011
127views more  TIT 2011»
15 years 1 months ago
Semiunitary Precoding for Spatially Correlated MIMO Channels
— The focus of this paper is on spatial precoding in correlated multi-antenna channels where the number of datastreams is adapted independent of the number of transmit antennas. ...
Vasanthan Raghavan, Akbar M. Sayeed, Venugopal V. ...
SIAMNUM
2010
134views more  SIAMNUM 2010»
15 years 1 months ago
Nonequispaced Hyperbolic Cross Fast Fourier Transform
A straightforward discretisation of problems in d spatial dimensions often leads to an exponential growth in the number of degrees of freedom. Thus, even efficient algorithms like ...
Michael Döhler, Stefan Kunis, Daniel Potts
TKDE
2010
149views more  TKDE 2010»
15 years 1 months ago
A Configurable Rete-OO Engine for Reasoning with Different Types of Imperfect Information
The RETE algorithm is a very efficient option for the development of a rule-based system, but it supports only boolean, first order logic. Many real-world contexts, instead, requir...
Davide Sottara, Paola Mello, Mark Proctor