Sciweavers

728 search results - page 112 / 146
» Compressing combinatorial objects
Sort
View
RSP
1998
IEEE
188views Control Systems» more  RSP 1998»
14 years 2 months ago
Performance and Interface Buffer Size Driven Behavioral Partitioning for Embedded Systems
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
T.-C. Lin, Sadiq M. Sait, Walling R. Cyre
VLDB
1997
ACM
99views Database» more  VLDB 1997»
14 years 1 months ago
Resource Scheduling in Enhanced Pay-Per-View Continuous Media Databases
The enhanced pay-per-view (EPPV) model for providing continuous-media-on-demand(CMOD) services associates with each continuous media clip a display frequency that dependson the cl...
Minos N. Garofalakis, Banu Özden, Abraham Sil...
APPROX
2008
Springer
127views Algorithms» more  APPROX 2008»
13 years 11 months ago
Approximating Single Machine Scheduling with Scenarios
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svenss...
BIS
2008
119views Business» more  BIS 2008»
13 years 11 months ago
Fuzzy Constraint-based Schema Matching Formulation
The deep Web has many challenges to be solved. Among them is schema matching. In this paper, we build a conceptual connection between the schema matching problem SMP and the fuzzy ...
Alsayed Algergawy, Eike Schallehn, Gunter Saake
SODA
2008
ACM
112views Algorithms» more  SODA 2008»
13 years 11 months ago
The effect of induced subgraphs on quasi-randomness
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a tr...
Asaf Shapira, Raphael Yuster