1055 search results - page 179 / 211 » Enumerations in computable structure theory |
KDD
2005
ACM
14 years 8 months ago
2005
ACM
Dyadic data matrices, such as co-occurrence matrix, rating matrix, and proximity matrix, arise frequently in various important applications. A fundamental problem in dyadic data a...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
: Given a logical topology and a physical topology , the survivable logical topology design problem in an IP-overWDM optical network is to map the logical links into lightpaths in ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
Given a set of n points S in the plane, a triangulation of S is a subdivision of the convex hull into triangles whose vertices are from S. In the kinetic setting, the input point ...
COMPGEOM
2010
ACM
14 years 26 days ago
2010
ACM
We present a simple randomized scheme for triangulating a set P of n points in the plane, and construct a kinetic data structure which maintains the triangulation as the points of...
HICSS
2002
IEEE
14 years 22 days ago
2002
IEEE
A computational enterprise model representing key facets of an organization can be an effective tool. For example, a specific organization's quality management business proce...