Sciweavers

4791 search results - page 767 / 959
» Clustering with partial information
Sort
View
SSDBM
1999
IEEE
140views Database» more  SSDBM 1999»
15 years 11 months ago
An Infrastructure for Scalable Parallel Multidimensional Analysis
Multidimensional Analysis in On-Line Analytical Processing (OLAP), and Scientific and statistical databases (SSDB) use operations requiring summary information on multi-dimensiona...
Sanjay Goil, Alok N. Choudhary
CP
2006
Springer
15 years 11 months ago
Boosting Open CSPs
In previous work, a new approach called Open CSP (OCSP) was defined as a way of integrate information gathering and problem solving. Instead of collecting all variable values befor...
Santiago Macho González, Carlos Ansó...
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
15 years 10 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
AVI
2008
15 years 9 months ago
Time2Hide: spatial searches and clutter alleviation for the desktop
The desktop metaphor aimed to create a working environment, which would resemble that of the user's desk. With information abundance this desktop is often cluttered with file...
George Lepouras, Aggelos Papatriantafyllou, Akrivi...
CTRSA
2008
Springer
150views Cryptology» more  CTRSA 2008»
15 years 9 months ago
Improving the Efficiency of Impossible Differential Cryptanalysis of Reduced Camellia and MISTY1
Abstract. Camellia and MISTY1 are Feistel block ciphers. In this paper, we observe that, when conducting impossible differential cryptanalysis on Camellia and MISTY1, their round s...
Jiqiang Lu, Jongsung Kim, Nathan Keller, Orr Dunke...