Sciweavers

4137 search results - page 285 / 828
» On the number of matchings of a tree
Sort
View
INFOCOM
1995
IEEE
15 years 10 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 6 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
ICIP
2000
IEEE
16 years 8 months ago
Scene Reconstruction from Multiple Cameras
This paper reviews a number of recently developed stereo matching algorithms and representations. It focuses on techniques that are especially well suited for stereoscopic and 3-D...
Richard Szeliski
IS
2010
15 years 5 months ago
Extracting a largest redundancy-free XML storage structure from an acyclic hypergraph in polynomial time
Given a hypergraph and a set of embedded functional dependencies, we investigate the problem of determining the conditions under which we can efficiently generate redundancy-free ...
Wai Yin Mok, Joseph Fong, David W. Embley
IPPS
2007
IEEE
16 years 1 months ago
Table-lookup based Crossbar Arbitration for Minimal-Routed, 2D Mesh and Torus Networks
Crossbar arbitration—which determines the allocation of output ports to packets in the input queues—is a performance-critical stage in the overall performance of routers for i...
Daeho Seo, Mithuna Thottethodi