Sciweavers

17018 search results - page 3359 / 3404
» From the How to the What
Sort
View
TCS
2002
13 years 8 months ago
Restriction categories I: categories of partial maps
Given a category with a stable system of monics, one can form the corresponding category of partial maps. To each map in this category there is, on the domain of the map, an assoc...
J. Robin B. Cockett, Stephen Lack
TMI
2002
248views more  TMI 2002»
13 years 8 months ago
Adaptive Elastic Segmentation of Brain MRI via Shape Model Guided Evolutionary Programming
This paper presents a fully automated segmentation method for medical images. The goal is to localize and parameterize a variety of types of structure in these images for subsequen...
Alain Pitiot, Arthur W. Toga, Paul M. Thompson
TROB
2002
149views more  TROB 2002»
13 years 8 months ago
LOST: localization-space trails for robot teams
Abstract-We describe Localization-Space Trails (LOST), a method that enables a team of robots to navigate between places of interest in an initially unknown environment using a tra...
Richard T. Vaughan, Kasper Støy, Gaurav S. ...
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 8 months ago
Maximum Bipartite Matching Size And Application to Cuckoo Hashing
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...
Josef Kanizo, David Hay, Isaac Keslassy
MST
2007
167views more  MST 2007»
13 years 8 months ago
The Complexity of Polynomial-Time Approximation
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
Liming Cai, Michael R. Fellows, David W. Juedes, F...
« Prev « First page 3359 / 3404 Last » Next »