6575 search results - page 807 / 1315 » Specializing visualization algorithms |
162
click to vote
ISAAC
2007
Springer
16 years 14 days ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
149
click to vote
TACAS
2007
Springer
16 years 13 days ago
2007
Springer
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
187
Voted
FOCS
2006
IEEE
16 years 12 days ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
163
click to vote
GLOBECOM
2006
IEEE
16 years 12 days ago
2006
IEEE
Abstract— For multi-user orthogonal frequency division multiplexing (OFDM) systems, efficient optimal rate and power allocation algorithms are presented via geometric programmin...
151
click to vote
ICDM
2006
IEEE
16 years 11 days ago
2006
IEEE
Free tree, as a special graph which is connected, undirected and acyclic, is extensively used in domains such as computational biology, pattern recognition, computer networks, XML...