Sciweavers

14161 search results - page 70 / 2833
» On generalized middle-level problem
Sort
View
COR
2008
142views more  COR 2008»
13 years 8 months ago
Modeling and solving the rooted distance-constrained minimum spanning tree problem
In this paper we discuss models and methods for solving the rooted distance constrained minimum spanning tree problem which is defined as follows: given a graph G = (V, E) with no...
Luis Gouveia, Ana Paias, Dushyant Sharma
CORR
2010
Springer
178views Education» more  CORR 2010»
13 years 7 months ago
Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
Daniel Dadush, Chris Peikert, Santosh Vempala
FOCS
2010
IEEE
13 years 6 months ago
The Coin Problem and Pseudorandomness for Branching Programs
The Coin Problem is the following problem: a coin is given, which lands on head with probability either 1/2 + or 1/2 - . We are given the outcome of n independent tosses of this co...
Joshua Brody, Elad Verbin
SIAMJO
2002
142views more  SIAMJO 2002»
13 years 8 months ago
A Complementary Pivoting Approach to the Maximum Weight Clique Problem
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...
Alessio Massaro, Marcello Pelillo, Immanuel M. Bom...
AIEDU
2010
13 years 3 months ago
Scaffolding Meta-Cognitive Skills for Effective Analogical Problem Solving via Tailored Example Selection
Although worked-out examples play a key role in cognitive skill acquisition, research demonstrates that students have various levels of meta-cognitive abilities for using examples ...
Kasia Muldner, Cristina Conati