Sciweavers

882 search results - page 175 / 177
» On the Hardness of Graph Isomorphism
Sort
View
VLC
2008
191views more  VLC 2008»
13 years 7 months ago
Visual specification of measurements and redesigns for domain specific visual languages
Ensuring model quality is a key success factor in many computer science areas, and becomes crucial in recent software engineering paradigms like the one proposed by model-driven s...
Esther Guerra, Juan de Lara, Paloma Díaz
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
13 years 5 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
FSTTCS
2010
Springer
13 years 5 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
DLOG
2009
13 years 5 months ago
Testing Provers on a Grid - Framework Description
Abstract. GridTest is a framework for testing automated theorem provers using randomly generated formulas. It can be used to run tests locally, in a single computer, or in a comput...
Carlos Areces, Daniel Gorín, Alejandra Lore...
TVCG
2011
136views more  TVCG 2011»
13 years 2 months ago
Interactive Mesh Cutting Using Constrained Random Walks
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
Juyong Zhang, Jianmin Zheng, Jianfei Cai