Sciweavers

1809 search results - page 92 / 362
» Weakly Computable Real Numbers
Sort
View
TOMS
2010
106views more  TOMS 2010»
15 years 2 months ago
Computing Tutte Polynomials
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...
Gary Haggard, David J. Pearce, Gordon Royle
CVPR
2003
IEEE
16 years 6 months ago
Computing Layered Surface Representations: An Algorithm for Detecting and Separating Transparent Overlays
The biological visual system possesses the ability to compute layered surface representations, in which one surface is represented as being viewed through another. This ability is...
Manish Singh, Xiaolei Huang
SC
2003
ACM
15 years 9 months ago
Optimizing Reduction Computations In a Distributed Environment
We investigate runtime strategies for data-intensive applications that involve generalized reductions on large, distributed datasets. Our set of strategies includes replicated fi...
Tahsin M. Kurç, Feng Lee, Gagan Agrawal, &U...
IJISEC
2006
119views more  IJISEC 2006»
15 years 3 months ago
A monitoring system for detecting repeated packets with applications to computer worms
Abstract We present a monitoring system which detects repeated packets in network traffic, and has applications including detecting computer worms. It uses Bloom filters with count...
Paul C. van Oorschot, Jean-Marc Robert, Miguel Var...
JPDC
2008
129views more  JPDC 2008»
15 years 3 months ago
A framework for scalable greedy coloring on distributed-memory parallel computers
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik ...