4114 search results - page 461 / 823 » Efficient Algorithms for the 2-Center Problems |
179
click to vote
ICALP
1990
Springer
15 years 10 months ago
1990
Springer
We show how (now familiar) hierarchical representations of (convex) polyhedra can be used to answer various separation queries efficiently (in a number of cases, optimally). Our e...
171
click to vote
DSD
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper describes principles of a novel two-level multi-output Boolean minimizer FC-Min, namely its Find Coverage phase. The problem of Boolean minimization is approached in a ...
150
click to vote
ECAI
2006
Springer
15 years 10 months ago
2006
Springer
Computer Supported Cooperative Work (CSCW) defines software tools and technology to support groups of people working together on a project, often at different sites [5]. In this wo...
177
click to vote
AI
2010
Springer
15 years 7 months ago
2010
Springer
The subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with ...
137
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Huffman coding finds an optimal prefix code for a given probability mass function. Consider situations in which one wishes to find an optimal code with the restriction that all cod...