Sciweavers

13987 search results - page 52 / 2798
» The Two Guards Problem
Sort
View
JLP
2007
89views more  JLP 2007»
14 years 11 months ago
Universality and semicomputability for nondeterministic programming languages over abstract algebras
tract Algebras Wei Jiang∗ , Yuan Wang† , and Jeffery Zucker‡ September 11, 2006 The Universal Function Theorem (UFT) originated in 1930s with the work of Alan Turing, who p...
Wei Jiang, Yuan Wang, Jeffery I. Zucker
ACSC
2005
IEEE
15 years 5 months ago
A Two-Pronged Attack on the Dragon of Intractability
One approach to tractably finding a solution to an NP-complete optimisation problem is heuristic, where the solution is inexact but quickly found; another approach is to reduce t...
Stephen Gilmour, Mark Dras
STOC
2010
ACM
195views Algorithms» more  STOC 2010»
15 years 4 months ago
Efficiently Learning Mixtures of Two Gaussians
Given data drawn from a mixture of multivariate Gaussians, a basic problem is to accurately estimate the mixture parameters. We provide a polynomial-time algorithm for this proble...
Adam Tauman Kalai, Ankur Moitra, and Gregory Valia...
DASFAA
2008
IEEE
115views Database» more  DASFAA 2008»
15 years 6 months ago
An Optimized Two-Step Solution for Updating XML Views
View updating is a long standing difficult problem. Given a view defined over base data sources and a view update, there are several different updates over the base data sources,...
Ling Wang, Ming Jiang 0003, Elke A. Rundensteiner,...
ESA
2006
Springer
137views Algorithms» more  ESA 2006»
15 years 3 months ago
Deciding Relaxed Two-Colorability - A Hardness Jump
A coloring is proper if each color class induces connected components of order one (where the order of a graph is its number of vertices). Here we study relaxations of proper two-c...
Robert Berke, Tibor Szabó