Sciweavers

3303 search results - page 342 / 661
» Multidimensional Access Methods
Sort
View
WWW
2007
ACM
16 years 7 months ago
Summarizing email conversations with clue words
Accessing an ever increasing number of emails, possibly on small mobile devices, has become a major problem for many users. Email summarization is a promising way to solve this pr...
Giuseppe Carenini, Raymond T. Ng, Xiaodong Zhou
KDD
2002
ACM
171views Data Mining» more  KDD 2002»
16 years 7 months ago
Mining complex models from arbitrarily large databases in constant time
In this paper we propose a scaling-up method that is applicable to essentially any induction algorithm based on discrete search. The result of applying the method to an algorithm ...
Geoff Hulten, Pedro Domingos
STOC
2007
ACM
84views Algorithms» more  STOC 2007»
16 years 7 months ago
Lower bounds in communication complexity based on factorization norms
We introduce a new method to derive lower bounds on randomized and quantum communication complexity. Our method is based on factorization norms, a notion from Banach Space theory....
Nati Linial, Adi Shraibman
ICALP
2009
Springer
16 years 7 months ago
Limits and Applications of Group Algebras for Parameterized Problems
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
Ioannis Koutis, Ryan Williams
MOBIHOC
2001
ACM
16 years 6 months ago
Comparison between graph-based and interference-based STDMA scheduling
Spatial reuse TDMA is a fixed assignment access scheme for multi-hop radio networks. The idea is to increase network capacity by letting several radio terminals use the same time ...
Anders Hansson, Jimmi Grönkvist