1055 search results - page 179 / 211 » Enumerations in computable structure theory |
84
Voted
KDD
2005
ACM
15 years 10 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...
86
Voted
INFOCOM
2009
IEEE
15 years 4 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
15 years 3 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
15 years 2 months 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
15 years 2 months 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...