Viewing profile — arnoldoMuller
arnoldoMuller
HN member- Joined
- Fri, Nov 05, 2010, 10:28 PM UTC
- HN karma
- 20
- Public activity
- 24 items
- HN profile
- View on Hacker News ↗
About arnoldoMuller
Similarity search is NoSQL 2.0, a key value storage where key is allowed to have mismatches and this similarity is defined with a distance function. Therefore you can store and retrieve audio, video and many other things.
Startup: http://simmachines.com Twitter: @amuller
Recent public activity
-
comment
Comment #4924988
In the same way is still happening in places like Okinawa: http://www.stripes.com/news/pacific/okinawa/marine-given-fou... ?
-
comment
Comment #4912749
My start-up simMachines obtained the grant during 2012. Feel free to ask questions about our experience.
- story
-
comment
Comment #4905821
My startup won the grant during the 2012 cycle. If you have any questions feel free to ask.
- story
-
comment
Comment #4750368
It could help I guess...
-
comment
Comment #4749422
I wonder how the accountability issues that Kickstarter ( http://www.kickstarter.com/blog/accountability-on-kickstarte... ) is dealing with recently affect a start-up like Givver. …
-
comment
Comment #4172926
I went as a Monbusho scholar in the period 2004 - 2009 and this is not the case anymore. Nowadays you spend a lot of time filling forms and getting access to basic services like ce…
-
comment
Comment #3970795
Interesting point, thank you!
-
comment
Comment #3969688
My startup has a fast nearest neighbor engine that allows to have far matches: http://simmachines.com/Products/r01.html We hope to be the "berkeley DB" of the big data era. Feedbac…
-
story
Arch Grants name 15 winners
15 companies were awarded $750,000 in grants, which come with professional services and office space downtown St. Louis. The startups come from a mix of industries and backgrounds.…
- story
- story
-
comment
Comment #3541351
This is a very important data structure from a historical point of view, but unfortunately it doesn't work well when you are dealing with complex spaces. Try LSH as mentioned befor…
-
comment
Comment #3472059
My twitter is: @amuller :) I will e-mail you when the videos are released.
-
comment
Comment #3471588
Hi Danny: Unfortunately not yet, they will be released but I am not sure when.
-
comment
Comment #3471109
You can solve complex things with k-nearest neighbor as long as you use an appropriate distance function. This is the beauty, a distance function abstracts the complexity. I tackle…
-
comment
Comment #3317917
The SISAP metric spaces library comes with an implementation: http://sisap.org/Metric_Space_Library.html You can also compare BK-trees with other methods and you may encounter that…
-
comment
Comment #3305311
VP trees are well known but not necessarily the best approach for large datasets or high dimensional objects. I am creating a startup that offers the fastest similarity search engi…
-
comment
Comment #2242221
There was a talk around where they were using two replacements at most(or two hash tables), and two hash functions. At insert time you add the object to the first hash table, if th…
-
comment
Comment #2240022
If your dimensionality is low then I totally agree, there is a library that can help you to achieve this: http://code.google.com/p/uzaygezen/ If you are dealing with objects with i…
-
comment
Comment #2240003
When I was building OBsearch.net I used this book extensively. I grant you that some explanations are not so detailed. On the other hand, the explanations of the most relevant tech…
-
comment
Comment #2219500
There are also a number of similarity search indexes available: http://obsearch.net/ http://www.sisap.org/Metric_Space_Library.html http://lshkit.sourceforge.net/
-
comment
Comment #1875204
If you count the number of people killed by wars in Europe or North America in the 20th century, Latin America is the place to be. Latin America has numerous social problems but th…