Sciweavers

13214 search results - page 2266 / 2643
» Pseudorandomness for network algorithms
Sort
View
TOPLAS
2008
79views more  TOPLAS 2008»
15 years 5 months ago
Witnessing side effects
We present a new approach to the old problem of adding side effects to purely functional languages. Our idea is to extend the language with "witnesses," which is based o...
Tachio Terauchi, Alex Aiken
MST
2010
106views more  MST 2010»
15 years 5 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
MTA
2010
118views more  MTA 2010»
15 years 5 months ago
A computation-oriented multimedia data streams model for content-based information retrieval
: Multimedia applications nowadays are becoming prevalent. In the past the relational database model was generalized to the multimedia database model. More recently the relational ...
Shi-Kuo Chang, Lei Zhao, Shenoda Guirguis, Rohit K...
NOMS
2010
IEEE
177views Communications» more  NOMS 2010»
15 years 5 months ago
An effective similarity metric for application traffic classification
—Application level traffic classification is one of the major issues in network monitoring and traffic engineering. In our previous study, we proposed a new traffic classificatio...
Jae Yoon Chung, Byungchul Park, Young J. Won, John...
PVLDB
2010
119views more  PVLDB 2010»
15 years 5 months ago
An Architecture for Parallel Topic Models
This paper describes a high performance sampling architecture for inference of latent topic models on a cluster of workstations. Our system is faster than previous work by over an...
Alexander J. Smola, Shravan Narayanamurthy
« Prev « First page 2266 / 2643 Last » Next »