Sciweavers

3591 search results - page 241 / 719
» Typing linear constraints
Sort
View
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
16 years 7 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson
POPL
2005
ACM
16 years 7 months ago
Connecting effects and uniqueness with adoption
Abstract. In a previous paper, we discussed how the concepts of uniqueness and effects are interdependent. In this paper, we show how "Adoption and Focus," a proposal for...
John Tang Boyland, William Retert
IJCGA
2000
64views more  IJCGA 2000»
15 years 7 months ago
High Fidelity Interval Assignment
Quadrilateral meshing algorithms impose certain constraints on the number of intervals or mesh edges of the curves bounding a surface. When constructing a conformal mesh of a colle...
Scott A. Mitchell
DEBU
1999
85views more  DEBU 1999»
15 years 6 months ago
Specifying Database Transformations in WOL
WOL is a Horn-clause language for specifying transformations involving complex types and recursive data-structures. Its declarative syntax makes programs easy to modify in respons...
Susan B. Davidson, Anthony Kosky
JSAC
2007
104views more  JSAC 2007»
15 years 7 months ago
Tomlinson-Harashima Precoding for Broadcast Channels with Uncertainty
— We consider the design of Tomlinson-Harashima (TH) precoders for broadcast channels in the presence of channel uncertainty. For systems in which uplink-downlink reciprocity is ...
Michael Botros Shenouda, Timothy N. Davidson