Sciweavers

2612 search results - page 156 / 523
» Switching Graphs and Their Complexity
Sort
View
122
Voted
TCS
2008
15 years 21 days ago
Main-memory triangle computations for very large (sparse (power-law)) graphs
Finding, counting and/or listing triangles (three vertices with three edges) in massive graphs are natural fundamental problems, which received recently much attention because of ...
Matthieu Latapy
77
Voted
ICMCS
2006
IEEE
101views Multimedia» more  ICMCS 2006»
15 years 6 months ago
Video Transcoding for Packet Loss Resilience Based on the Multiple Descriptions
This paper proposes error resilient video transcoding structures based on the multiple description (MD) scheme. Two structures are proposed for different use, namely low complexit...
Il Kim, Nam Cho
112
Voted
ISPD
1999
ACM
128views Hardware» more  ISPD 1999»
15 years 5 months ago
Transistor level micro-placement and routing for two-dimensional digital VLSI cell synthesis
There is an increasing need in modern VLSI designs for circuits implemented in high-performance logic families such as Cascode Voltage Switch Logic, Pass Transistor Logic, and dom...
Michael A. Riepe, Karem A. Sakallah
107
Voted
AAAI
2007
15 years 3 months ago
Continuous State POMDPs for Object Manipulation Tasks
My research focus is on using continuous state partially observable Markov decision processes (POMDPs) to perform object manipulation tasks using a robotic arm. During object mani...
Emma Brunskill
127
Voted
GG
2008
Springer
15 years 1 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell