5100 search results - page 887 / 1020 » The Linear Complexity of a Graph |
157
click to vote
ACID
2006
15 years 6 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
277
click to vote
ACST
2006
15 years 6 months ago
2006
Including mathematical expressions in documents can be a tiresome and difficult process. A recognition system for handwritten mathematical expressions would greatly simplify the t...
144
Voted
AIPS
2006
15 years 6 months ago
2006
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
130
Voted
ECIS
2003
15 years 6 months ago
2003
Multiple combinations of hardware and network components can be selected to design an information technology (IT) infrastructure that satisfies performance requirements. The profe...
132
Voted
NETWORKING
2004
15 years 6 months ago
2004
In this paper we propose a new packet classification algorithm, which can substantially improve the performance of a classifier by decreasing the rulebase lookup latency. The algor...