Sciweavers

1222 search results - page 55 / 245
» Some Results on Directable Automata
Sort
View
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
14 years 11 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
ISCAS
2006
IEEE
93views Hardware» more  ISCAS 2006»
15 years 3 months ago
Phase-tracking loop based on delta-sigma oversampling architecture
Abstract— This paper presents a new oversampling architecture for implementing phase-tracking loop that is commonly utilized for position sensors such that synchro, resolver, and...
Yuichiro Orino, Minoru Kuribayashi Kurosawa, Takas...
CSDA
2006
71views more  CSDA 2006»
14 years 9 months ago
Computation of Huber's M-estimates for a block-angular regression problem
Huber's M-estimation technique is applied to a block-angular regression problem, which may arise from some applications. A recursive, modified Newton approach to computing th...
Xiao-Wen Chang
ACL
2010
14 years 7 months ago
Efficient Inference through Cascades of Weighted Tree Transducers
Weighted tree transducers have been proposed as useful formal models for representing syntactic natural language processing applications, but there has been little description of ...
Jonathan May, Kevin Knight, Heiko Vogler
ICSE
2001
IEEE-ACM
15 years 2 months ago
Encoding Program Executions
Dynamic analysis is based on collecting data as the program runs. However, raw traces tend to be too voluminous and too unstructured to be used directly for visualization and unde...
Steven P. Reiss, Manos Renieris