Sciweavers

540 search results - page 63 / 108
» Competitive Routing over Time
Sort
View
NAACL
2010
14 years 11 months ago
Streaming First Story Detection with application to Twitter
With the recent rise in popularity and size of social media, there is a growing need for systems that can extract useful information from this amount of data. We address the probl...
Sasa Petrovic, Miles Osborne, Victor Lavrenko
JDCTA
2010
111views more  JDCTA 2010»
14 years 8 months ago
A Conceptual Representation of Consumer's Group Knowledge and the Possible Role of New Technologies
The purpose of this article is to encourage research on the aspects of consumer behaviour, particularly as found in groups of consumers. For both researchers and practitioners, co...
Massimo Franco, Francesca Di Virgilio, Loredana Di...
SIGMOD
2010
ACM
120views Database» more  SIGMOD 2010»
14 years 8 months ago
Paper bricks: an alternative to complete-story peer reviewing
The peer review system as used in several computer science communities has several flaws including long review times, overloaded reviewers, as well as fostering of niche topics. T...
Jens Dittrich
ICCAD
2002
IEEE
227views Hardware» more  ICCAD 2002»
15 years 10 months ago
Generic ILP versus specialized 0-1 ILP: an update
Optimized solvers for the Boolean Satisfiability (SAT) problem have many applications in areas such as hardware and software verification, FPGA routing, planning, etc. Further use...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
IR
2008
15 years 1 months ago
A compressed self-index using a Ziv-Lempel dictionary
A compressed full-text self-index for a text T , of size u, is a data structure used to search for patterns P, of size m, in T , that requires reduced space, i.e. space that depend...
Luís M. S. Russo, Arlindo L. Oliveira