Sciweavers

4114 search results - page 650 / 823
» Efficient Algorithms for the 2-Center Problems
Sort
View
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 9 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
TCAD
2008
128views more  TCAD 2008»
13 years 9 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...
ICIP
2001
IEEE
14 years 10 months ago
Adaptive motion search with elastic diamond for MPEG-4 video coding
Video coding is a complex process, comprising a combination of spatial, temporal and statistical data reduction techniques. Of these techniques, motion estimation taking advantage...
Weiguo Zheng, Ishfaq Ahmad, Ming Lei Liou
BMCBI
2005
162views more  BMCBI 2005»
13 years 9 months ago
Accelerated probabilistic inference of RNA structure evolution
Background: Pairwise stochastic context-free grammars (Pair SCFGs) are powerful tools for evolutionary analysis of RNA, including simultaneous RNA sequence alignment and secondary...
Ian Holmes
LICS
1994
IEEE
14 years 1 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka