3204 search results - page 284 / 641 » The b-chromatic Number of a Graph |
103
Voted
BMCBI
2010
15 years 28 days ago
2010
Background: Today it is common to apply multiple potentially conflicting data sources to a given phylogenetic problem. At the same time, several different inference techniques are...
121
Voted
CGF
2010
15 years 28 days ago
2010
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
114
Voted
IJDAR
2006
15 years 24 days ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
124
click to vote
IM
2007
15 years 22 days ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
220
Voted
ICDE
2008
IEEE
16 years 2 months ago
2008
IEEE
Given a record set D and a query score function F, a top-k query returns k records from D, whose values of function F on their attributes are the highest. In this paper, we investi...