Sciweavers

760 search results - page 122 / 152
» Algorithms for finding clique-transversals of graphs
Sort
View
ASPDAC
2001
ACM
103views Hardware» more  ASPDAC 2001»
13 years 11 months ago
Efficient minimum spanning tree construction without Delaunay triangulation
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
Hai Zhou, Narendra V. Shenoy, William Nicholls
HT
1991
ACM
13 years 11 months ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman
BIBM
2008
IEEE
106views Bioinformatics» more  BIBM 2008»
13 years 9 months ago
Uncovering Genomic Reassortments among Influenza Strains by Enumerating Maximal Bicliques
The evolutionary histories of viral genomes have received significant recent attention due to their importance in understanding virulence and the corresponding ramifications to pu...
Niranjan Nagarajan, Carl Kingsford
RECSYS
2010
ACM
13 years 7 months ago
Interactive recommendations in social endorsement networks
An increasing number of social networking platforms are giving users the option to endorse entities that they find appealing, such as videos, photos, or even other users. We defin...
Theodoros Lappas, Dimitrios Gunopulos
ANOR
2008
66views more  ANOR 2008»
13 years 7 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...