Sciweavers

7773 search results - page 274 / 1555
» On generalized Frame-Stewart numbers
Sort
View
STACS
2007
Springer
16 years 21 days ago
The Polynomially Bounded Perfect Matching Problem Is in NC 2
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierau...
WDAG
2007
Springer
105views Algorithms» more  WDAG 2007»
16 years 20 days ago
Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links
A group of identical mobile agents moving asynchronously among the nodes of an anonymous network have to gather together in a single node of the graph. This problem known as the (a...
Jérémie Chalopin, Shantanu Das, Nico...
3DPVT
2006
IEEE
180views Visualization» more  3DPVT 2006»
16 years 19 days ago
Building a 3D Virtual Museum of Native American Baskets
— In this paper we report our progress in building a system for the acquisition, analysis, and visualization of a collection of Native Californian baskets from the Phoebe A. Hear...
Volkan Isler, Bradford Wilson, Ruzena Bajcsy
ACSC
2006
IEEE
16 years 19 days ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
BROADNETS
2006
IEEE
16 years 19 days ago
Complexity of Converter Placement Supporting Broadcast in WDM Networks
Abstract— Wavelength converters simplify the wavelength assignment problem in virtual topology design in optical networks and increase the utilization of the fiber bandwidth. Ho...
Rudra Dutta, Prashant Iyer, Carla D. Savage