Sciweavers

13784 search results - page 1993 / 2757
» On Computing Functions with Uncertainty
Sort
View
ICS
2010
Tsinghua U.
16 years 5 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant
SDM
2009
SIAM
140views Data Mining» more  SDM 2009»
16 years 4 months ago
Straightforward Feature Selection for Scalable Latent Semantic Indexing.
Latent Semantic Indexing (LSI) has been validated to be effective on many small scale text collections. However, little evidence has shown its effectiveness on unsampled large sca...
Jun Yan, Shuicheng Yan, Ning Liu, Zheng Chen
SDM
2009
SIAM
164views Data Mining» more  SDM 2009»
16 years 4 months ago
Time-Decayed Correlated Aggregates over Data Streams.
Data stream analysis frequently relies on identifying correlations and posing conditional queries on the data after it has been seen. Correlated aggregates form an important examp...
Graham Cormode, Srikanta Tirthapura, Bojian Xu
ASAP
2009
IEEE
182views Hardware» more  ASAP 2009»
16 years 4 months ago
NeMo: A Platform for Neural Modelling of Spiking Neurons Using GPUs
—Simulating spiking neural networks is of great interest to scientists wanting to model the functioning of the brain. However, large-scale models are expensive to simulate due to...
Andreas Fidjeland, Etienne B. Roesch, Murray Shana...
SOFSEM
2010
Springer
16 years 4 months ago
Fast Arc-Annotated Subsequence Matching in Linear Space
An arc-annotated string is a string of characters, called bases, augmented with a set of pairs, called arcs, each connecting two bases. Given arc-annotated strings P and Q the arc-...
Philip Bille, Inge Li Gørtz
« Prev « First page 1993 / 2757 Last » Next »