Sciweavers

1964 search results - page 384 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
COLING
1992
13 years 8 months ago
The Kant System: Fast, Accurate, High-Quality Translation In Practical Domains
Knowledge-based interlingual machine translation systems produce semantically accurate translations, but typically require massive knowledge acquisition. Ongoing research and deve...
Eric Nyberg, Teruko Mitamura
CCR
2005
76views more  CCR 2005»
13 years 7 months ago
Simplifying the synthesis of internet traffic matrices
A recent paper [8] presented methods for several steps along the road to synthesis of realistic traffic matrices. Such synthesis is needed because traffic matrices are a crucial i...
Matthew Roughan
CORR
2011
Springer
160views Education» more  CORR 2011»
12 years 11 months ago
Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs
Although many algorithms have been designed to construct Bayesian network structures using different approaches and principles, they all employ only two methods: those based on i...
Silvia Acid, Luis M. de Campos
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 8 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
CVPR
2008
IEEE
14 years 9 months ago
Learning Bayesian Networks with qualitative constraints
Graphical models such as Bayesian Networks (BNs) are being increasingly applied to various computer vision problems. One bottleneck in using BN is that learning the BN model param...
Yan Tong, Qiang Ji