Sciweavers

2654 search results - page 159 / 531
» On Pairing Inversion Problems
Sort
View
WABI
2010
Springer
124views Bioinformatics» more  WABI 2010»
15 years 4 months ago
Improved Orientations of Physical Networks
Abstract. The orientation of physical networks is a prime task in deciphering the signaling-regulatory circuitry of the cell. One manifestation of this computational task is as a m...
Iftah Gamzu, Danny Segev, Roded Sharan
AAIM
2007
Springer
106views Algorithms» more  AAIM 2007»
15 years 10 months ago
A New Efficient Algorithm for Computing the Longest Common Subsequence
Abstract. The Longest Common Subsequence (LCS) problem is a classic and well-studied problem in computer science. The LCS problem is a common task in DNA sequence analysis with man...
M. Sohel Rahman, Costas S. Iliopoulos
SIGIR
2009
ACM
16 years 23 days ago
Entropy-biased models for query representation on the click graph
Query log analysis has received substantial attention in recent years, in which the click graph is an important technique for describing the relationship between queries and URLs....
Hongbo Deng, Irwin King, Michael R. Lyu
ICC
2007
IEEE
183views Communications» more  ICC 2007»
16 years 17 days ago
Most Reliable Routing in WDM Mesh Networks with Arbitrary Risk Distribution
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
Ji Li, Kwan Lawrence Yeung
CORR
2010
Springer
166views Education» more  CORR 2010»
15 years 6 months ago
A new closed-loop output error method for parameter identification of robot dynamics
Off-line robot dynamic identification methods are mostly based on the use of the inverse dynamic model, which is linear with respect to the dynamic parameters. This model is sample...
Maxime Gautier, Alexandre Janot, Pierre-Olivier Va...