Sciweavers

917 search results - page 183 / 184
» Comparison of Data Structures for Computing Formal Concepts
Sort
View
ICFP
2003
ACM
14 years 5 months ago
FreshML: programming with binders made simple
FreshML extends ML with elegant and practical constructs for declaring and manipulating syntactical data involving statically scoped binding operations. User-declared FreshML data...
Mark R. Shinwell, Andrew M. Pitts, Murdoch Gabbay
COMPSAC
2002
IEEE
13 years 10 months ago
An Approach to Identify Duplicated Web Pages
A relevant consequence of the unceasing expansion of the Web and e-commerce is the growth of the demand of new Web sites and Web applications. The software industry is facing the ...
Giuseppe A. Di Lucca, Massimiliano Di Penta, Anna ...
POPL
1998
ACM
13 years 9 months ago
From System F to Typed Assembly Language
abstractions, such as closures, tuples, and user-defined abstract data types. The type system ensures that well-typed programs cannot violate these abstractions. In addition, the ...
J. Gregory Morrisett, David Walker, Karl Crary, Ne...
FUIN
2010
136views more  FUIN 2010»
13 years 2 months ago
Modeling Biology using Generic Reactive Animation
Abstract. Complex biological systems involve incorporated behaviors of numerous processes, mechanisms and objects. However, experimental analysis, by its nature, divides biological...
Yaki Setty, Irun R. Cohen, David Harel
ICDE
2010
IEEE
428views Database» more  ICDE 2010»
14 years 5 months ago
Supporting Top-K Keyword Search in XML Databases
Keyword search is considered to be an effective information discovery method for both structured and semistructured data. In XML keyword search, query semantics is based on the con...
Liang Jeff Chen, Yannis Papakonstantinou