Sciweavers

195 search results - page 37 / 39
» Evolving by Maximizing the Number of Rules: Complexity Study
Sort
View
RIDE
1998
IEEE
15 years 1 months ago
On Periodic Resource Scheduling for Continuous Media Databases
The Enhanced Pay-Per-View (EPPV) model for providing continuous-media services associates with each continuous-media clip a display frequency that depends on the clip's popula...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
CCR
2002
86views more  CCR 2002»
14 years 9 months ago
Hop-by-hop routing algorithms for premium traffic
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
Jun Wang, Klara Nahrstedt
STOC
2006
ACM
174views Algorithms» more  STOC 2006»
15 years 10 months ago
Edge-disjoint paths in Planar graphs with constant congestion
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
MM
2006
ACM
178views Multimedia» more  MM 2006»
15 years 3 months ago
Multimedia signal processing for behavioral quantification in neuroscience
While there have been great advances in quantification of the genotype of organisms, including full genomes for many species, the quantification of phenotype is at a comparatively...
Peter Andrews, Haibin Wang, Dan Valente, Jih&egrav...
ECCC
2010
83views more  ECCC 2010»
14 years 7 months ago
Symmetric LDPC codes are not necessarily locally testable
Locally testable codes, i.e., codes where membership in the code is testable with a constant number of queries, have played a central role in complexity theory. It is well known t...
Eli Ben-Sasson, Ghid Maatouk, Amir Shpilka, Madhu ...