Sciweavers

1458 search results - page 13 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
VL
2005
IEEE
135views Visual Languages» more  VL 2005»
14 years 2 months ago
Easing Program Comprehension by Sharing Navigation Data
Large software projects often require a programmer to make changes to unfamiliar source code. This paper describes a set of tools, called Team Tracks, designed to ease program com...
Robert DeLine, Mary Czerwinski, George G. Robertso...
COMBINATORICS
2000
89views more  COMBINATORICS 2000»
13 years 8 months ago
Large Dihedral Symmetry of the Set of Alternating Sign Matrices
We prove a conjecture of Cohn and Propp, which refines a conjecture of Bosley and Fidkowski about the symmetry of the set of alternating sign matrices (ASMs). We examine data aris...
Benjamin Wieland
CCA
2009
Springer
14 years 1 months ago
From Interval Computations to Constraint-Related Set Computations: Towards Faster Estimation of Statistics and ODEs under Interv
Interval computations estimate the uncertainty of the result of data processing in situations in which we only know the upper bounds ∆ on the measurement errors. In this case, ba...
Vladik Kreinovich
ER
2007
Springer
137views Database» more  ER 2007»
14 years 2 months ago
Prioritized Preferences and Choice Constraints
It is increasingly recognised that user preferences should be addressed in many advanced database applications, such as adaptive searching in databases. However, the fundamental is...
Wilfred Ng
INFORMATICALT
2008
162views more  INFORMATICALT 2008»
13 years 8 months ago
Vague Rough Set Techniques for Uncertainty Processing in Relational Database Model
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
Karan Singh, Samajh Singh Thakur, Mangi Lal