Sciweavers

5606 search results - page 538 / 1122
» Randomization Techniques for Graphs.
Sort
View
SIGMOD
2003
ACM
112views Database» more  SIGMOD 2003»
16 years 7 months ago
A Theory of Redo Recovery
Our goal is to understand redo recovery. We define an installation graph of operations in an execution, an ordering significantly weaker than conflict ordering from concurrency co...
David B. Lomet, Mark R. Tuttle
IV
2007
IEEE
164views Visualization» more  IV 2007»
16 years 1 months ago
Combining DagMaps and Sugiyama Layout for the Navigation of Hierarchical Data
This paper presents a novel technique for exploring and navigating large hierarchies, not restricted to trees but to directed acyclic graphs (dags). The technique combines two dif...
Pierre-Yves Koenig, Guy Melançon, Charles B...
ECTEL
2007
Springer
16 years 1 months ago
Adaptation of the ACO Heuristic for Sequencing Learning Activities
This paper describes an initiative aimed at adapting swarm intelligence techniques (in particular, Ant Colony Optimization) to an e-learning environment, thanks to the fact that th...
Sergio Gutiérrez Santos, Grégory Val...
ICMCS
2005
IEEE
137views Multimedia» more  ICMCS 2005»
16 years 24 days ago
Co-Clustering of Time-Evolving News Story with Transcript and Keyframe
This paper presents techniques in clustering the sametopic news stories according to event themes. We model the relationship of stories with textual and visual concepts under the ...
Xiao Wu, Chong-Wah Ngo, Qing Li
SYNASC
2005
IEEE
129views Algorithms» more  SYNASC 2005»
16 years 24 days ago
Logic Restructuring for Delay Balancing in Wave-Pipelined Circuits: An Integer Programming Approach
In this paper we apply integer programming (IP) based techniques to the problem of delay balancing in wave-pipelined circuits. The proposed approach considers delays, as well as f...
Srivastav Sethupathy, Nohpill Park, Marcin Paprzyc...