244 search results - page 32 / 49 » Intervalizing k-Colored Graphs |
WG
2005
Springer
15 years 3 months ago
2005
Springer
Partitive set families are families of sets that can be quite large, but have a compact, recursive representation in the form of a tree. This tree is a common generalization of PQ...
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
The problem of characterizing all the testable graph properties is considered by many to be the most important open problem in the area of property-testing. Our main result in thi...
PVLDB
2010
14 years 8 months ago
2010
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
92
Voted
ESA
2007
Springer
15 years 1 months ago
2007
Springer
We consider the problem of pricing items so as to maximize the profit made from selling these items. An instance is given by a set E of n items and a set of m clients, where each c...
DATE
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract—Modern embedded multimedia systems process multiple concurrent streams of data processing jobs. Streams often have throughput requirements. These jobs are implemented on...