664 search results - page 16 / 133 » Solution to the Counterfeit Coin Problem and its Generalizat... |
120
click to vote
ICDM
2006
IEEE
15 years 4 months ago
2006
IEEE
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
DOCENG
2006
ACM
15 years 3 months ago
2006
ACM
Automatic table layout is required in web applications. Unfortunately, this is NP-hard for reasonable layout requirements such as minimizing table height for a given width. One ap...
AI
2003
Springer
15 years 3 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
ADBIS
2010
Springer
14 years 11 months ago
2010
Springer
Medical Information Systems (MIS) in general, like any other complex and large system, can be based on centralized or distributed DBMS. Centralized system is much easier for implem...
NETWORKS
2010
14 years 8 months ago
2010
We consider a probabilistic model for the Steiner Tree problem. Under this model the problem is defined in a 2-stage setting over a first-stage complete weighted graph having it...