Sciweavers

131 search results - page 18 / 27
» Leftist Canonical Ordering
Sort
View
ISSAC
2004
Springer
93views Mathematics» more  ISSAC 2004»
15 years 6 months ago
Finding the smallest image of a set
We describe an algorithm for finding a canonical image of a set of points under the action of a permutation group. Specifically if we order images by sorting them and ordering t...
Steve Linton
106
Voted
JAIR
2008
171views more  JAIR 2008»
15 years 16 days ago
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical Models
Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Multi-Valued Decision Diagrams (MDD) with AND nodes, in order to capture function ...
Robert Mateescu, Rina Dechter, Radu Marinescu 0002
110
Voted
INFOCOM
2010
IEEE
14 years 11 months ago
Distributed Caching Algorithms for Content Distribution Networks
—The delivery of video content is expected to gain huge momentum, fueled by the popularity of user-generated clips, growth of VoD libraries, and wide-spread deployment of IPTV se...
Sem C. Borst, Varun Gupta, Anwar Walid
ICPP
2009
IEEE
14 years 10 months ago
Using Subfiling to Improve Programming Flexibility and Performance of Parallel Shared-file I/O
There are two popular parallel I/O programming styles used by modern scientific computational applications: unique-file and shared-file. Unique-file I/O usually gives satisfactory ...
Kui Gao, Wei-keng Liao, Arifa Nisar, Alok N. Choud...
119
Voted
DEXAW
2007
IEEE
92views Database» more  DEXAW 2007»
15 years 7 months ago
Subtree Testing and Closed Tree Mining Through Natural Representations
Several classical schemes exist to represent trees as strings over a fixed alphabet; these are useful in many algorithmic and conceptual studies. Our previous work has proposed a...
José L. Balcázar, Albert Bifet, Anto...