Sciweavers

2268 search results - page 300 / 454
» The Essence of Form Abstraction
Sort
View
CPM
2010
Springer
180views Combinatorics» more  CPM 2010»
15 years 6 months ago
Algorithms for Three Versions of the Shortest Common Superstring Problem
Abstract. The input to the Shortest Common Superstring (SCS) problem is a set S of k words of total length n. In the classical version the output is an explicit word SCS(S) in whic...
Maxime Crochemore, Marek Cygan, Costas S. Iliopoul...
FUN
2010
Springer
263views Algorithms» more  FUN 2010»
15 years 6 months ago
Kaboozle Is NP-complete, Even in a Strip
Abstract. Kaboozle is a puzzle consisting of several square cards, each annotated with colored paths and dots drawn on both sides and holes drilled. The goal is to join two colored...
Tetsuo Asano, Erik D. Demaine, Martin L. Demaine, ...
PAKDD
2010
ACM
152views Data Mining» more  PAKDD 2010»
15 years 6 months ago
Mining Association Rules in Long Sequences
Abstract. Discovering interesting patterns in long sequences, and finding confident association rules within them, is a popular area in data mining. Most existing methods define...
Boris Cule, Bart Goethals
116
Voted
CCGRID
2009
IEEE
15 years 6 months ago
Dynamic Provisioning of Virtual Organization Clusters
Virtual Organization Clusters are systems comprised of virtual machines that provide dedicated computing clusters for each individual Virtual Organization. The design of these clu...
Michael A. Murphy, Brandon Kagey, Michael Fenn, Se...
CDC
2009
IEEE
189views Control Systems» more  CDC 2009»
15 years 6 months ago
Maximizing aggregated revenue in sensor networks under deadline constraints
Abstract— We study the problem of maximizing the aggregated revenue in sensor networks with deadline constraints. Our model is that of a sensor network that is arranged in the fo...
Srikanth Hariharan, Ness B. Shroff