Sciweavers

5889 search results - page 218 / 1178
» Graph Layout Problems
Sort
View
ANOR
2008
66views more  ANOR 2008»
15 years 6 months ago
Optimization problems involving collections of dependent objects
We describe a class of problems motivated by numerous real-world applications where there is a collection of objects that have both a cost and a value, but where some of those obj...
David L. Roberts, Charles L. Isbell, Michael L. Li...
UIST
2000
ACM
15 years 11 months ago
Cross-modal interaction using XWeb
The XWeb project addresses the problem of interacting with services by means of a variety of interactive platforms. Interactive clients are provided on a variety of hardware/softw...
Dan R. Olsen, Sean Jefferies, S. Travis Nielsen, W...
MFCS
2009
Springer
16 years 1 months ago
A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
Michael R. Fellows, Jiong Guo, Hannes Moser, Rolf ...
JAIR
2010
90views more  JAIR 2010»
15 years 1 months ago
An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem
The Hamiltonian cycle problem (HCP) is an important combinatorial problem with applications in many areas. It is among the first problems used for studying intrinsic properties, i...
Gerold Jäger, Weixiong Zhang
HICSS
2008
IEEE
199views Biometrics» more  HICSS 2008»
16 years 29 days ago
Clustering and the Biclique Partition Problem
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
Doina Bein, Linda Morales, Wolfgang W. Bein, C. O....